Introduced in 1977, Rivest–Shamir–Adleman or RSA is one among

the first public-key Cryptography used for secure data transmission.

This cryptography depends on solving a factoring problem with two

large prime numbers. Though RSA is tough to breach, compared to

DSA, it’s faster for its signature validation and slower in generation.

Being there for a long time, RSA is most widely used and best

supported.

1.5.1.2.2 DSA

Digital Signature Algorithm or DSA, a variant of the Schnorr and

ElGamal signature was proposed by the National Institute of

Standards and Technology (NIST) in 1991. Based on a discrete

logarithmic problem, it’s still used by Federal Information Processing

Standard for digital signatures. In comparison to RSA, it’s faster for

signature generation but slower for validation.

1.5.1.2.3 Elliptic curve cryptography and ECDSA

Discovered in 1985, Elliptic curve cryptography or ECC is a

contemporary powerful approach to public-key cryptography that

relies on mathematical elliptic curves. It’s adopted by Bitcoin and

many other cryptocurrencies and Blockchain for creating smaller,

faster, and more efficient cryptographic keys.

Elliptic Curve implementation of DSA or ECDSA has managed to

provide similar security levels as RSA with a shorter encryption key.

Hence, it needs less computing power leading to a faster processing

than the keys of the previous generation. One of the disadvantages

though is that it makes the size of the encrypted messages much

bigger. Also, it’s much more complex to implement in comparison to

RSA.

1.5.1.2.4 Edward curve Cryptography and EdDSA

In Cryptography, Edward curves are a family of Elliptic curves

introduced in 2008 that has been utilised in Edwards-curve Digital

Signature Algorithm or EdDSA. Using intractable discrete logarithmic

problems, EdDSA is safer than the previous cryptographic versions

as DSA and ECDSA. Being one of the latest work in cryptography, it